Less Than Perfect Procedure

نویسنده

  • Pascal Nicod
چکیده

G iven the high prevalence of coronary artery disease in Western countries, selection of the optimal therapeutic strategy for individual cardiac patients has become an issue of utmost costbenefit importance. During the past two decades, large clinical trials have established the respective roles of medical treatment versus coronary artery bypass surgery in the management of patients with coronary disease. In 1978, Grintzig et al's report of their early experience with coronary angioplasty1 opened the era of interventional cardiology, and since then, angioplasty has emerged as a major tool in the armamentarium for treating coronary artery disease. Initially, the use of angioplasty was restricted to selected patients with angina pectoris refractory to medical treatment. However, as interventionists became more skilled and equipment more sophisticated, indications for angioplasty were rapidly extended to include patients with moderate or mild angina. This led to an exponential growth in the number of angioplasties performed over the past decade, and in 1991, more than 300,000 procedures were performed in the United States alone at an estimated cost of $7.2 billion, representing roughly 1% of the total annual expenditure for health care.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

الگوی مصرف آنتی‌بیوتیک‌ها در بخش‌های بیمارستان ولیعصر زنجان

Background and Objective: Unreasonable prescription and indiscriminate use of antibiotics bring about increased antimicrobial resistance. Evaluating the pattern of use seems to be a perfect procedure to improve its reasonable prescription. The objective of this study was to evaluate pattern of antibiotic use in different units of  Zanjan Vali-Asr Teaching Hospital. Materials and Methods: Thi...

متن کامل

Exact Minimum Degree Thresholds for Perfect Matchings in Uniform Hypergraphs Iii

We determine the exact minimum l-degree threshold for perfect matchings in k-uniform hypergraphs when the corresponding threshold for perfect fractional matchings is significantly less than 1 2 ( n k−l ) . This extends our previous results [18, 19] that determine the minimum l-degree thresholds for perfect matchings in k-uniform hypergraphs for all l ≥ k/2 and provides two new (exact) threshold...

متن کامل

Approximate Viscous Shock-Layer Analysis of Axisymmetric Bodies in Perfect Gas Hypersonic Flow

In this paper, an approximate axisymmetric method is developed which can reliably calculate fully viscous hypersonic flow over blunt-nosed bodies. In this method, a Maslen’s second-order pressure expression is used instead of the normal momentum equation. The combination of Maslen’s second-order pressure expression and viscous shock layer equations is developed to accurately and efficiently com...

متن کامل

Rationality and equilibrium in perfect-information games

In generic perfect-information games the unique Subgame-Perfect Equilibrium (SPE) outcome is identical to the one predicted by several rationalizability notions, like Extensive-Form Rationalizability (EFR), the Backward Dominance Procedure (BDP), and Extensive-Form Rationalizability of the Agent form (AEFR). We show that, in contrast, within the general class of perfect information games all th...

متن کامل

On the Rate of Convergence of Variable Metric Algorithms for Unconstrained Optimization

A procedure is described tha t is suitable for investigating rates of convergence of variable metric algorithms numerically. The usual rate seems to be the one tha t is given by Ritter [6], but, except when there are only two variables, we are unable to prove that Bitter's rate is achieved under mild conditions on the objective function. An example is given to show that , even though the object...

متن کامل

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005